A Greedy Approach for Computing Longest Common Subsequences
نویسندگان
چکیده
This paper presents an algorithm for computing Longest Common Subsequences for two sequences. Given two strings X and Y of length m and n, we present a greedy algorithm, which requires O(n log s) preprocessing time, where s is distinct symbols appearing in string Y and O(m) time to determines Longest Common Subsequences.
منابع مشابه
Computing the Number of Longest Common Subsequences
This note provides very simple, efficient algorithms for computing the number of distinct longest common subsequences of two input strings and for computing the number of LCS embeddings.
متن کاملFACC: A Novel Finite Automaton Based on Cloud Computing for the Multiple Longest Common Subsequences Search
Searching for the multiple longest common subsequences MLCS has significant applications in the areas of bioinformatics, information processing, and data mining, and so forth, Although a few parallel MLCS algorithms have been proposed, the efficiency and effectiveness of the algorithms are not satisfactory with the increasing complexity and size of biologic data. To overcome the shortcomings of...
متن کاملSemi-local longest common subsequences and maximum cliques in circle graphs
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In a previous paper, we defined a generalisation, called “the all semi-local LCS problem”, for which we proposed an efficient geometric output representation, and an efficient algorithm running in time o(mn) when m and n are reasonab...
متن کاملLongest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs
For two strings a, b, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In a previous paper, we defined a generalisation, called “the all semi-local LCS problem”, for which we proposed an efficient output representation and an efficient algorithm. In this paper, we consider a restriction of this problem to strings that are permutati...
متن کاملA Parallel Non-Alignment Based Approach to Efficient Sequence Comparison using Longest Common Subsequences
Biological sequence comparison programs have revolutionized the practice of biochemistry, molecular and evolutionary biology. Pairwise comparison is the method of choice for many computational tools developed to analyze the deluge of genetic sequence data. Unfortunately, a comprehensive study of the strengths and weaknesses of different alignment algorithms applied to different biological probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008